#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

struct Record {
    string name, id;
    int grade;
    
    bool operator < (const Record & r1) const {
        return grade > r1.grade;
    }
}record[N];

int n;
int lo, up;

inline void solution() {
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ ) {
        char name[15], id[15];
        int sc;
        scanf("%s%s%d", name, id, &sc);
        record[i].name = name;
        record[i].id = id;
        record[i].grade = sc;
    }
    scanf("%d%d", &lo, &up);
    sort(record, record + n);
    int res = 0;
    for (int i = 0; i < n; i ++ ) {
        if (record[i].grade >= lo && record[i].grade <= up) {
            res ++ ;
            cout << record[i].name << " " << record[i].id << endl;
        } 
    }
    if (!res) cout << "NONE" << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}